Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata
نویسندگان
چکیده
This paper presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata. A polynomial time algorithm to randomly generate a pushdown automaton having a fixed stack operations total size is proposed. The influence of the accepting condition (empty stack, final state) on the reachability of the generated automata is investigated.
منابع مشابه
Enumeration and random generation of possibly incomplete deterministic automata
This paper presents an efficient random generator, based on a Boltzmann sampler, for accessible, deterministic and possibly not complete automata. An interesting intermediate result is that for any finite alphabet, the proportion of complete automata with n states amongst deterministic and accessible ones is greater than a positive constant.
متن کاملEnumeration and random generation of accessible automata
We present a bijection between the set An of deterministic and accessible automata with n states on a k-letters alphabet and some diagrams, which can themselves be represented as partitions of a set of kn+1 elements into n non-empty subsets. This combinatorial construction shows that the asymptotic order of the cardinality of An is related to the Stirling number { kn n } . Our bijective approac...
متن کاملRandom generation of possibly incomplete deterministic automata
This paper presents an efficient random generator, based on a Boltzmann sampler, for accessible, deterministic and possibly not complete automata. An intermediate result is that Θ(1) of accessible and deterministic automata are complete.
متن کاملSimulation of Two-Way Pushdown Automata Revisited
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook’s in...
متن کاملLanguage Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding regularity is NL-complete as well.
متن کامل